Incremental Development of Diagnostic Set-Covering Models with Therapy Effects
نویسندگان
چکیده
We will consider set–covering models for diagnostic tasks handling uncertain knowledge. Because these models have to be build manually by domain experts, we will show how this effort can be reduced by an incremental development of the set–covering models. Thus simple models can be enhanced by similarities, weights and uncertainty to increase the quality of the knowledge and the resulting system. We will also present mechanisms for generating set–covering models when higher level knowledge about causation effects is available. Finally, we will motivate how our approach can be used for implementing diagnosis systems including therapy effects.
منابع مشابه
Multigranulation single valued neutrosophic covering-based rough sets and their applications to multi-criteria group decision making
In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...
متن کاملInvestigating the Asymmetry in Volatility for the Iranian Stock Market
This paper investigates the asymmetry in volatility of returns for the Iranian stock market using the daily closing values of the Tehran exchange price index (TEPIX) covering the period from March 25, 2001 to July 25, 2012, with a total of 2743 observations. To this end, two sets of tests have been employed: the first set is based on the residuals derived from a symmetric GARCH (1,1) model. The...
متن کاملDiagnostic Reasoning with Multilevel Set-Covering Models
We consider multilevel set-covering models for diagnostic reasoning: though a lot of work has been done in this field, knowledge acquisition efforts have been investigated only insufficiently. We will show how set-covering models can be build incrementally and how they can be refined by knowledge enhancements or representational extensions. All these extensions have a primary characteristic: th...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملProfiles of covering arrays of strength two
Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
دوره 11 شماره
صفحات -
تاریخ انتشار 2003